public class demo7 {
    //斐波那契
    public int fib(int n) {
        //1.建dp表
        int[] dp = new int[n+1];
        //2.初始化
        dp[0] = 0;
        if(n == 0)
            return dp[0];
        dp[1] = 1;
        //3.填表
        for(int i =2;i<=n;i++)
        {
            dp[i] = dp[i-1]+dp[i-2];
        }
        //4.返回值
        return dp[n];
    }
}
